TSTP Solution File: SEV054^5 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : SEV054^5 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n017.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 09:41:12 EDT 2024
% Result : Theorem 0.13s 0.37s
% Output : Refutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 5 unt; 7 typ; 0 def)
% Number of atoms : 223 ( 95 equ; 0 cnn)
% Maximal formula atoms : 22 ( 12 avg)
% Number of connectives : 461 ( 52 ~; 34 |; 46 &; 298 @)
% ( 0 <=>; 31 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 8 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 64 ( 64 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 142 ( 2 ^ 115 !; 24 ?; 142 :)
% ( 1 !>; 0 ?*; 0 @-; 0 @+)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
a: $tType ).
thf(func_def_0,type,
a: $tType ).
thf(func_def_4,type,
sK0: a > a > $o ).
thf(func_def_5,type,
sK1: ( a > $o ) > a ).
thf(func_def_6,type,
sK2: a > ( a > $o ) > a ).
thf(func_def_7,type,
sK3: a > a ).
thf(func_def_10,type,
ph5:
!>[X0: $tType] : X0 ).
thf(f27,plain,
$false,
inference(trivial_inequality_removal,[],[f26]) ).
thf(f26,plain,
$true != $true,
inference(beta_eta_normalization,[],[f21]) ).
thf(f21,plain,
( $true
!= ( ^ [Y0: a] : $true
@ ( sK3
@ ( sK1
@ ^ [Y0: a] : $true ) ) ) ),
inference(primitive_instantiation,[],[f20]) ).
thf(f20,plain,
! [X0: a > $o] :
( $true
!= ( X0 @ ( sK3 @ ( sK1 @ X0 ) ) ) ),
inference(trivial_inequality_removal,[],[f19]) ).
thf(f19,plain,
! [X0: a > $o] :
( ( $true
!= ( X0 @ ( sK3 @ ( sK1 @ X0 ) ) ) )
| ( $true != $true ) ),
inference(superposition,[],[f14,f18]) ).
thf(f18,plain,
! [X2: a > $o,X3: a] :
( ( ( sK0 @ X3 @ ( sK1 @ X2 ) )
= $true )
| ( ( X2 @ X3 )
!= $true ) ),
inference(cnf_transformation,[],[f12]) ).
thf(f12,plain,
( ! [X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( ( sK0 @ X3 @ ( sK1 @ X2 ) )
= $true ) )
& ! [X4: a] :
( ( $true
= ( sK0 @ ( sK1 @ X2 ) @ X4 ) )
| ( ( ( X2 @ ( sK2 @ X4 @ X2 ) )
= $true )
& ( $true
!= ( sK0 @ ( sK2 @ X4 @ X2 ) @ X4 ) ) ) ) )
& ! [X7: a,X8: a] :
( ( $true
= ( sK0 @ ( sK3 @ X7 ) @ ( sK3 @ X8 ) ) )
| ( $true
!= ( sK0 @ X7 @ X8 ) ) )
& ! [X9: a] :
( $true
!= ( sK0 @ ( sK3 @ X9 ) @ X9 ) )
& ! [X10: a,X11: a,X12: a] :
( ( $true
= ( sK0 @ X12 @ X11 ) )
| ( $true
!= ( sK0 @ X12 @ X10 ) )
| ( $true
!= ( sK0 @ X10 @ X11 ) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3])],[f8,f11,f10,f9]) ).
thf(f9,plain,
( ? [X0: a > a > $o,X1: ( a > $o ) > a] :
( ! [X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( $true
= ( X0 @ X3 @ ( X1 @ X2 ) ) ) )
& ! [X4: a] :
( ( $true
= ( X0 @ ( X1 @ X2 ) @ X4 ) )
| ? [X5: a] :
( ( $true
= ( X2 @ X5 ) )
& ( $true
!= ( X0 @ X5 @ X4 ) ) ) ) )
& ? [X6: a > a] :
( ! [X7: a,X8: a] :
( ( $true
= ( X0 @ ( X6 @ X7 ) @ ( X6 @ X8 ) ) )
| ( ( X0 @ X7 @ X8 )
!= $true ) )
& ! [X9: a] :
( $true
!= ( X0 @ ( X6 @ X9 ) @ X9 ) ) )
& ! [X10: a,X11: a,X12: a] :
( ( $true
= ( X0 @ X12 @ X11 ) )
| ( ( X0 @ X12 @ X10 )
!= $true )
| ( $true
!= ( X0 @ X10 @ X11 ) ) ) )
=> ( ! [X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( ( sK0 @ X3 @ ( sK1 @ X2 ) )
= $true ) )
& ! [X4: a] :
( ( $true
= ( sK0 @ ( sK1 @ X2 ) @ X4 ) )
| ? [X5: a] :
( ( $true
= ( X2 @ X5 ) )
& ( $true
!= ( sK0 @ X5 @ X4 ) ) ) ) )
& ? [X6: a > a] :
( ! [X8: a,X7: a] :
( ( $true
= ( sK0 @ ( X6 @ X7 ) @ ( X6 @ X8 ) ) )
| ( $true
!= ( sK0 @ X7 @ X8 ) ) )
& ! [X9: a] :
( ( sK0 @ ( X6 @ X9 ) @ X9 )
!= $true ) )
& ! [X12: a,X11: a,X10: a] :
( ( $true
= ( sK0 @ X12 @ X11 ) )
| ( $true
!= ( sK0 @ X12 @ X10 ) )
| ( $true
!= ( sK0 @ X10 @ X11 ) ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f10,plain,
! [X2: a > $o,X4: a] :
( ? [X5: a] :
( ( $true
= ( X2 @ X5 ) )
& ( $true
!= ( sK0 @ X5 @ X4 ) ) )
=> ( ( ( X2 @ ( sK2 @ X4 @ X2 ) )
= $true )
& ( $true
!= ( sK0 @ ( sK2 @ X4 @ X2 ) @ X4 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f11,plain,
( ? [X6: a > a] :
( ! [X8: a,X7: a] :
( ( $true
= ( sK0 @ ( X6 @ X7 ) @ ( X6 @ X8 ) ) )
| ( $true
!= ( sK0 @ X7 @ X8 ) ) )
& ! [X9: a] :
( ( sK0 @ ( X6 @ X9 ) @ X9 )
!= $true ) )
=> ( ! [X8: a,X7: a] :
( ( $true
= ( sK0 @ ( sK3 @ X7 ) @ ( sK3 @ X8 ) ) )
| ( $true
!= ( sK0 @ X7 @ X8 ) ) )
& ! [X9: a] :
( $true
!= ( sK0 @ ( sK3 @ X9 ) @ X9 ) ) ) ),
introduced(choice_axiom,[]) ).
thf(f8,plain,
? [X0: a > a > $o,X1: ( a > $o ) > a] :
( ! [X2: a > $o] :
( ! [X3: a] :
( ( ( X2 @ X3 )
!= $true )
| ( $true
= ( X0 @ X3 @ ( X1 @ X2 ) ) ) )
& ! [X4: a] :
( ( $true
= ( X0 @ ( X1 @ X2 ) @ X4 ) )
| ? [X5: a] :
( ( $true
= ( X2 @ X5 ) )
& ( $true
!= ( X0 @ X5 @ X4 ) ) ) ) )
& ? [X6: a > a] :
( ! [X7: a,X8: a] :
( ( $true
= ( X0 @ ( X6 @ X7 ) @ ( X6 @ X8 ) ) )
| ( ( X0 @ X7 @ X8 )
!= $true ) )
& ! [X9: a] :
( $true
!= ( X0 @ ( X6 @ X9 ) @ X9 ) ) )
& ! [X10: a,X11: a,X12: a] :
( ( $true
= ( X0 @ X12 @ X11 ) )
| ( ( X0 @ X12 @ X10 )
!= $true )
| ( $true
!= ( X0 @ X10 @ X11 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,plain,
? [X1: a > a > $o,X0: ( a > $o ) > a] :
( ! [X5: a > $o] :
( ! [X6: a] :
( ( ( X5 @ X6 )
!= $true )
| ( $true
= ( X1 @ X6 @ ( X0 @ X5 ) ) ) )
& ! [X7: a] :
( ( ( X1 @ ( X0 @ X5 ) @ X7 )
= $true )
| ? [X8: a] :
( ( $true
= ( X5 @ X8 ) )
& ( $true
!= ( X1 @ X8 @ X7 ) ) ) ) )
& ? [X9: a > a] :
( ! [X11: a,X10: a] :
( ( $true
= ( X1 @ ( X9 @ X11 ) @ ( X9 @ X10 ) ) )
| ( $true
!= ( X1 @ X11 @ X10 ) ) )
& ! [X12: a] :
( $true
!= ( X1 @ ( X9 @ X12 ) @ X12 ) ) )
& ! [X3: a,X2: a,X4: a] :
( ( $true
= ( X1 @ X4 @ X2 ) )
| ( $true
!= ( X1 @ X4 @ X3 ) )
| ( $true
!= ( X1 @ X3 @ X2 ) ) ) ),
inference(flattening,[],[f6]) ).
thf(f6,plain,
? [X0: ( a > $o ) > a,X1: a > a > $o] :
( ? [X9: a > a] :
( ! [X11: a,X10: a] :
( ( $true
= ( X1 @ ( X9 @ X11 ) @ ( X9 @ X10 ) ) )
| ( $true
!= ( X1 @ X11 @ X10 ) ) )
& ! [X12: a] :
( $true
!= ( X1 @ ( X9 @ X12 ) @ X12 ) ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( ( X5 @ X6 )
!= $true )
| ( $true
= ( X1 @ X6 @ ( X0 @ X5 ) ) ) )
& ! [X7: a] :
( ( ( X1 @ ( X0 @ X5 ) @ X7 )
= $true )
| ? [X8: a] :
( ( $true
= ( X5 @ X8 ) )
& ( $true
!= ( X1 @ X8 @ X7 ) ) ) ) )
& ! [X3: a,X2: a,X4: a] :
( ( $true
= ( X1 @ X4 @ X2 ) )
| ( $true
!= ( X1 @ X4 @ X3 ) )
| ( $true
!= ( X1 @ X3 @ X2 ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
thf(f5,plain,
~ ! [X0: ( a > $o ) > a,X1: a > a > $o] :
( ( ! [X5: a > $o] :
( ! [X6: a] :
( ( ( X5 @ X6 )
= $true )
=> ( $true
= ( X1 @ X6 @ ( X0 @ X5 ) ) ) )
& ! [X7: a] :
( ! [X8: a] :
( ( $true
= ( X5 @ X8 ) )
=> ( $true
= ( X1 @ X8 @ X7 ) ) )
=> ( ( X1 @ ( X0 @ X5 ) @ X7 )
= $true ) ) )
& ! [X3: a,X2: a,X4: a] :
( ( ( $true
= ( X1 @ X4 @ X3 ) )
& ( $true
= ( X1 @ X3 @ X2 ) ) )
=> ( $true
= ( X1 @ X4 @ X2 ) ) ) )
=> ! [X9: a > a] :
( ! [X10: a,X11: a] :
( ( $true
= ( X1 @ X11 @ X10 ) )
=> ( $true
= ( X1 @ ( X9 @ X11 ) @ ( X9 @ X10 ) ) ) )
=> ? [X12: a] :
( $true
= ( X1 @ ( X9 @ X12 ) @ X12 ) ) ) ),
inference(fool_elimination,[],[f4]) ).
thf(f4,plain,
~ ! [X0: ( a > $o ) > a,X1: a > a > $o] :
( ( ! [X2: a,X3: a,X4: a] :
( ( ( X1 @ X3 @ X2 )
& ( X1 @ X4 @ X3 ) )
=> ( X1 @ X4 @ X2 ) )
& ! [X5: a > $o] :
( ! [X6: a] :
( ( X5 @ X6 )
=> ( X1 @ X6 @ ( X0 @ X5 ) ) )
& ! [X7: a] :
( ! [X8: a] :
( ( X5 @ X8 )
=> ( X1 @ X8 @ X7 ) )
=> ( X1 @ ( X0 @ X5 ) @ X7 ) ) ) )
=> ! [X9: a > a] :
( ! [X10: a,X11: a] :
( ( X1 @ X11 @ X10 )
=> ( X1 @ ( X9 @ X11 ) @ ( X9 @ X10 ) ) )
=> ? [X12: a] : ( X1 @ ( X9 @ X12 ) @ X12 ) ) ),
inference(rectify,[],[f2]) ).
thf(f2,negated_conjecture,
~ ! [X1: ( a > $o ) > a,X0: a > a > $o] :
( ( ! [X4: a,X3: a,X2: a] :
( ( ( X0 @ X3 @ X4 )
& ( X0 @ X2 @ X3 ) )
=> ( X0 @ X2 @ X4 ) )
& ! [X5: a > $o] :
( ! [X4: a] :
( ( X5 @ X4 )
=> ( X0 @ X4 @ ( X1 @ X5 ) ) )
& ! [X6: a] :
( ! [X7: a] :
( ( X5 @ X7 )
=> ( X0 @ X7 @ X6 ) )
=> ( X0 @ ( X1 @ X5 ) @ X6 ) ) ) )
=> ! [X8: a > a] :
( ! [X3: a,X2: a] :
( ( X0 @ X2 @ X3 )
=> ( X0 @ ( X8 @ X2 ) @ ( X8 @ X3 ) ) )
=> ? [X9: a] : ( X0 @ ( X8 @ X9 ) @ X9 ) ) ),
inference(negated_conjecture,[],[f1]) ).
thf(f1,conjecture,
! [X1: ( a > $o ) > a,X0: a > a > $o] :
( ( ! [X4: a,X3: a,X2: a] :
( ( ( X0 @ X3 @ X4 )
& ( X0 @ X2 @ X3 ) )
=> ( X0 @ X2 @ X4 ) )
& ! [X5: a > $o] :
( ! [X4: a] :
( ( X5 @ X4 )
=> ( X0 @ X4 @ ( X1 @ X5 ) ) )
& ! [X6: a] :
( ! [X7: a] :
( ( X5 @ X7 )
=> ( X0 @ X7 @ X6 ) )
=> ( X0 @ ( X1 @ X5 ) @ X6 ) ) ) )
=> ! [X8: a > a] :
( ! [X3: a,X2: a] :
( ( X0 @ X2 @ X3 )
=> ( X0 @ ( X8 @ X2 ) @ ( X8 @ X3 ) ) )
=> ? [X9: a] : ( X0 @ ( X8 @ X9 ) @ X9 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.SpJgXIU7Xr/Vampire---4.8_6431',cTHM403_pme) ).
thf(f14,plain,
! [X9: a] :
( $true
!= ( sK0 @ ( sK3 @ X9 ) @ X9 ) ),
inference(cnf_transformation,[],[f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SEV054^5 : TPTP v8.1.2. Released v4.0.0.
% 0.06/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox2/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 11:28:06 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_NEQ_NAR problem
% 0.13/0.34 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox2/tmp/tmp.SpJgXIU7Xr/Vampire---4.8_6431
% 0.13/0.36 % (6541)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on Vampire---4 for (2999ds/27Mi)
% 0.13/0.36 % (6543)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.13/0.36 % (6542)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on Vampire---4 for (2999ds/2Mi)
% 0.13/0.36 % (6540)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on Vampire---4 for (2999ds/4Mi)
% 0.13/0.36 % (6544)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on Vampire---4 for (2999ds/275Mi)
% 0.13/0.36 % (6546)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on Vampire---4 for (2999ds/3Mi)
% 0.13/0.36 % (6545)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on Vampire---4 for (2999ds/18Mi)
% 0.13/0.36 % (6542)Instruction limit reached!
% 0.13/0.36 % (6542)------------------------------
% 0.13/0.36 % (6542)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (6542)Termination reason: Unknown
% 0.13/0.36 % (6542)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (6543)Instruction limit reached!
% 0.13/0.36 % (6543)------------------------------
% 0.13/0.36 % (6543)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (6543)Termination reason: Unknown
% 0.13/0.36 % (6543)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (6543)Memory used [KB]: 5500
% 0.13/0.36 % (6543)Time elapsed: 0.003 s
% 0.13/0.36 % (6543)Instructions burned: 3 (million)
% 0.13/0.36 % (6543)------------------------------
% 0.13/0.36 % (6543)------------------------------
% 0.13/0.36 % (6542)Memory used [KB]: 5500
% 0.13/0.36 % (6542)Time elapsed: 0.003 s
% 0.13/0.36 % (6542)Instructions burned: 2 (million)
% 0.13/0.36 % (6542)------------------------------
% 0.13/0.36 % (6542)------------------------------
% 0.13/0.36 % (6546)Instruction limit reached!
% 0.13/0.36 % (6546)------------------------------
% 0.13/0.36 % (6546)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (6546)Termination reason: Unknown
% 0.13/0.36 % (6546)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (6546)Memory used [KB]: 5500
% 0.13/0.36 % (6546)Time elapsed: 0.003 s
% 0.13/0.36 % (6546)Instructions burned: 3 (million)
% 0.13/0.36 % (6546)------------------------------
% 0.13/0.36 % (6546)------------------------------
% 0.13/0.36 % (6544)First to succeed.
% 0.13/0.36 % (6539)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on Vampire---4 for (2999ds/183Mi)
% 0.13/0.36 % (6540)Instruction limit reached!
% 0.13/0.36 % (6540)------------------------------
% 0.13/0.36 % (6540)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.36 % (6540)Termination reason: Unknown
% 0.13/0.36 % (6540)Termination phase: Saturation
% 0.13/0.36
% 0.13/0.36 % (6540)Memory used [KB]: 5500
% 0.13/0.36 % (6540)Time elapsed: 0.005 s
% 0.13/0.36 % (6540)Instructions burned: 5 (million)
% 0.13/0.36 % (6540)------------------------------
% 0.13/0.36 % (6540)------------------------------
% 0.13/0.36 % (6545)Also succeeded, but the first one will report.
% 0.13/0.37 % (6544)Refutation found. Thanks to Tanya!
% 0.13/0.37 % SZS status Theorem for Vampire---4
% 0.13/0.37 % SZS output start Proof for Vampire---4
% See solution above
% 0.13/0.37 % (6544)------------------------------
% 0.13/0.37 % (6544)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.13/0.37 % (6544)Termination reason: Refutation
% 0.13/0.37
% 0.13/0.37 % (6544)Memory used [KB]: 5500
% 0.13/0.37 % (6544)Time elapsed: 0.005 s
% 0.13/0.37 % (6544)Instructions burned: 2 (million)
% 0.13/0.37 % (6544)------------------------------
% 0.13/0.37 % (6544)------------------------------
% 0.13/0.37 % (6538)Success in time 0.017 s
% 0.13/0.37 % Vampire---4.8 exiting
%------------------------------------------------------------------------------